Correction to: A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem
نویسندگان
چکیده
منابع مشابه
Flexible job-shop scheduling with parallel variable neighborhood search algorithm
Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the machines. This paper proposes a parallel variable neighborhood search (PVNS)...
متن کاملMulti Agents approach for Job Shop Scheduling Problem using Genetic Algorithm and Variable Neighborhood Search method
The job shop scheduling is an important and complex problem for a manufacturing system. It is well known and popular problem having (Non-Polynomial) NP-hard characteristic to find the optimal or near optimal solution (schedules) quickly. In job shop scheduling a set of “N” number of jobs are processed through an “M” number of given set of machines. It must be processed in the prescribed order b...
متن کاملA Novel Variable Neighborhood Genetic Algorithm for Multi-objective Flexible Job-Shop Scheduling Problems
Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. It is quite difficult to achieve optimal or near-optimal solutions with single traditional optimization approach because the multi objective FJSP has the high computational complexity. An novel hybrid algorithm ...
متن کاملGenetic algorithm for the flexible job-shop scheduling problem
In this paper, we propose a new optimization technique, the hierarchical multi-space competitive distributed genetic algorithm (HmcDGA), which is effective for the hierarchical optimization problem. It is an extension of the multi-space competitive distributed genetic algorithm (mcDGA), which was proposed by the authors. The mcDGA efficiently finds an optimal solution with a low computational c...
متن کاملVariable Neighborhood Genetic Algorithm for the Flexible Job Shop Scheduling Problems
Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. A Variable Neighborhood Genetic Algorithm (VNGA) is proposed for the problem with makespan criterion, consisting of a combination of the variable neighborhood search (VNS) and genetic algorithm (GA). Variable ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cluster Computing
سال: 2018
ISSN: 1386-7857,1573-7543
DOI: 10.1007/s10586-018-2328-3